Planar Finitely Suslinian Compacta

نویسنده

  • ALEXANDER BLOKH
چکیده

We show that a planar unshielded compact set X is finitely Suslinian if and only if there exists a closed set F ⊂ S and a lamination ∼ of F such that F/∼ is homeomorphic to X. If X is a continuum, the analogous statement follows from Carathéodory theory and is widely used in polynomial dynamics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of Curves

We show that each of the classes of hereditarily locally connected, finitely Suslinian, and Suslinian continua is Π1-complete, while the class of regular continua is Π4-complete.

متن کامل

The Suslinian Number and Other Cardinal Invariants of Continua

By the Suslinian number Sln(X) of a continuum X we understand the smallest cardinal number κ such that X contains no disjoint family C of non-degenerate subcontinua of size |C| ≥ κ. For a compact space X, Sln(X) is the smallest Suslinian number of a continuum which contains a homeomorphic copy of X. Our principal result asserts that each compact space X has weight ≤ Sln(X)+ and is the limit of ...

متن کامل

Cohomological Dimension of Markov Compacta

We rephrase Gromov’s definition of Markov compacta, introduce a subclass of Markov compacta defined by one building block and study cohomological dimensions of these compacta. We show that for a Markov compactum X, dimZ(p) X = dimQ X for all but finitely many primes p where Z(p) is the localization of Z at p. We construct Markov compacta of arbitrarily large dimension having dimQ X = 1 as well ...

متن کامل

The complexity of continuous embeddability between dendrites

We show that the quasi-order of continuous embeddability between finitely branching dendrites (a natural class of fairly simple compacta) is Σ1-complete. We also show that embeddability between countable linear orders with infinitely many colors is Σ1-complete.

متن کامل

Generating the Cycle Space of Planar Graphs

We prove that the cycle space of every planar finitely separable 3-connected graph G is generated by some Aut(G)-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006